On the average Steiner distance of graphs with prescribed propertiesDANKELMANN, P; SWART, H. C; OELLERMANN, O. R et al.Discrete applied mathematics. 1997, Vol 79, Num 1-3, pp 91-103, issn 0166-218XArticle

Graph properties and hypergraph colouringsBROWN, J. I; CORNEIL, D. G.Discrete mathematics. 1991, Vol 98, Num 2, pp 81-93, issn 0012-365XArticle

The categorical product of two 5-chromatic digraphs can be 3-chromaticBESSY, Stéphane; THOMASSE, Stéphan.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 344-346, issn 0012-365X, 3 p.Article

A color problem for fuzzy graphBERSHTEIN, Leonid; BOZHENUK, Alexander.Lecture notes in computer science. 2001, pp 500-505, issn 0302-9743, isbn 3-540-42732-5Conference Paper

A new approximation algorithm for the register allocation problemJANSEN, K; REITER, J.Lecture notes in computer science. 1997, pp 135-146, issn 0302-9743, isbn 3-540-63138-0Conference Paper

Dense graphs have K3,t minorsKOSTOCHKA, A. V; PRINCE, N.Discrete mathematics. 2010, Vol 310, Num 20, pp 2637-2654, issn 0012-365X, 18 p.Article

Cliques, minors and apex graphsJIANBING NIU; ZHANG, Cun-Quan.Discrete mathematics. 2009, Vol 309, Num 12, pp 4093-4105, issn 0012-365X, 13 p.Article

The two possible values of the chromatic number of a random graphACHLIOPTAS, Dimitris; NAOR, Assaf.Annals of mathematics. 2005, Vol 162, Num 3, pp 1335-1351, issn 0003-486X, 17 p.Article

Open colorings, the continuum and the second uncountable cardinalMOORE, Justin Tatch.Proceedings of the American Mathematical Society. 2002, Vol 130, Num 9, pp 2753-2759, issn 0002-9939Article

The minimum color sum of bipartite graphsBAR-NOY, A; KORTSARZ, G.Lecture notes in computer science. 1997, pp 738-748, issn 0302-9743, isbn 3-540-63165-8Conference Paper

An approach to Hedetniemi's conjectureSAUER, N. W; ZHU, X.Journal of graph theory. 1992, Vol 16, Num 5, pp 423-436, issn 0364-9024Article

On the chromatic number of special distance graphsVOIGT, M; WALTHER, H.Discrete mathematics. 1991, Vol 97, Num 1-3, pp 395-397, issn 0012-365XArticle

Approximation results for the optimum cost chromatic partition problemJANSEN, K.Lecture notes in computer science. 1997, pp 727-737, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Parallel edge coloring approximationFURER, M; RAGHAVACHARI, B.Parallel processing letters. 1996, Vol 6, Num 3, pp 321-329, issn 0129-6264Article

Improved formula for evaluating color-differential thresholdsGARCIA, J. A; ROMERO, J; JIMENEZ DE BARCO, L et al.Applied optics. 1992, Vol 31, Num 29, pp 6292-6298, issn 0003-6935Article

An inequality for the group chromatic number of a graphLAI, Hong-Jian; XIANGWEN LI; GEXIN YU et al.Discrete mathematics. 2007, Vol 307, Num 23, pp 3076-3080, issn 0012-365X, 5 p.Article

Coloration des graphes de reines = On the queen graphs coloring problemVASQUEZ, Michel.Comptes rendus. Mathématique. 2006, Vol 342, Num 3, pp 157-160, issn 1631-073X, 4 p.Article

Approximating maximum independent sets in uniform hypergraphsHOFMEISTER, T; LEFMANN, H.Lecture notes in computer science. 1998, pp 562-570, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Computing kernels in directed bichromatic graphsVON KARGER, B; BERGHAMMER, R.Information processing letters. 1997, Vol 62, Num 1, pp 5-11, issn 0020-0190Article

Chromatic binary search trees : A structure for concurrent rebalancingNURMI, O; SOISALON-SOININEN, E.Acta informatica. 1996, Vol 33, Num 6, pp 547-557, issn 0001-5903Article

Case 6 of Hadwiger's conjecture. III: The problem of 7-verticesMAYER, J.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 381-387, issn 0012-365XConference Paper

Chromaticity of certain tripartite graphs identified with a pathLAU, G. C; PENG, Y. H.Discrete mathematics. 2006, Vol 306, Num 22, pp 2893-2900, issn 0012-365X, 8 p.Article

The edge version of Hadwiger's conjectureGUOLI DING.Discrete mathematics. 2009, Vol 309, Num 5, pp 1118-1122, issn 0012-365X, 5 p.Conference Paper

Choice number of complete multipartite graphs K3*3,2* (k-5), 1*2 and K_4,3*2,2* (k-6), 1*3WENJIE HE; LINGMIN ZHANG; CRANSTON, Daniel W et al.Discrete mathematics. 2008, Vol 308, Num 23, pp 5871-5877, issn 0012-365X, 7 p.Article

Distance graphs with maximum chromatic numberBARAJAS, Javier; SERRA, Oriol.Discrete mathematics. 2008, Vol 308, Num 8, pp 1355-1365, issn 0012-365X, 11 p.Conference Paper